- hash chain
- цепочка хешированная (соединяющая элементы хеш-таблицы с одним и тем же хеш-кодом)
English-Russian dictionary of computer science and programming. 2013.
English-Russian dictionary of computer science and programming. 2013.
Hash chain — In computer security, a hash chain is a method to produce many one time keys from a single key or password. Definition A hash chain is a successive application of a cryptographic hash function h(x) to a string.For example,h(h(h(h(x))))gives a… … Wikipedia
Hash list — In computer science, a hash list is typically a list of hashes of the data blocks in a file or set of files. Lists of hashes are used for many different purposes, such as fast table lookup (hash tables) and distributed databases (distributed hash … Wikipedia
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Chain hash table — This is a hash table implementation. Here collisions are handled by Chaining.The divisor used is 13. A double Array is used for implementation ie Array of pointers. 1 // Authors: Prerit Goel and Anant Sinha 2 #include 3 struct node 4 { 5 int… … Wikipedia
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
Lempel-Ziv-Markov chain algorithm — The Lempel Ziv Markov chain Algorithm (LZMA) is an algorithm used to perform data compression. It has been under development since 1998 [The SDK history file states that it was in development from 1996, and first used in 7 zip 2001 08 30. Aside… … Wikipedia
Linear hash — Linear Hashing is a dynamic hash table algorithm invented by Witold Litwin (1980) [ Citation | first1=Witold | last1=Litwin | title=Linear hashing: A new tool for file and table addressing | journal=Proc. 6th Conference on Very Large Databases |… … Wikipedia
Maher-shalal-hash-baz — (Hebrew: מַהֵר שָׁלָל חָשׁ בַּז) Hurry to spoil! or He has made haste to the plunder! was the second mentioned son of the prophet Isaiah.[1] The name is a reference to the impending plunder of Samaria and Damascus by the king of Assyria. Maher… … Wikipedia
Lempel-Ziv-Markoff chain-Algorithm — Lempel Ziv Markow Algorithmus (LZMA) ist ein freier Datenkompressionsalgorithmus, der von Igor Pavlov seit 1998 entwickelt wird und vergleichsweise gute Kompressionsraten und eine hohe Geschwindigkeit beim Entpacken erreicht. Er ist benannt nach… … Deutsch Wikipedia
Lempel-Ziv-Markov chain-Algorithm — Lempel Ziv Markow Algorithmus (LZMA) ist ein freier Datenkompressionsalgorithmus, der von Igor Pavlov seit 1998 entwickelt wird und vergleichsweise gute Kompressionsraten und eine hohe Geschwindigkeit beim Entpacken erreicht. Er ist benannt nach… … Deutsch Wikipedia
Lempel-Ziv-Markow chain-Algorithm — Lempel Ziv Markow Algorithmus (LZMA) ist ein freier Datenkompressionsalgorithmus, der von Igor Pavlov seit 1998 entwickelt wird und vergleichsweise gute Kompressionsraten und eine hohe Geschwindigkeit beim Entpacken erreicht. Er ist benannt nach… … Deutsch Wikipedia